3 research outputs found
Solving Many-Objective Car Sequencing Problems on Two-Sided Assembly Lines Using an Adaptive Differential Evolutionary Algorithm
The car sequencing problem (CSP) is addressed in this paper. The original environment of the CSP is modified to reflect real practices in the automotive industry by replacing the use of single-sided straight assembly lines with two-sided assembly lines. As a result, the problem becomes more complex caused by many additional constraints to be considered. Six objectives (i.e. many objectives) are optimised simultaneously including minimising the number of colour changes, minimising utility work, minimising total idle time, minimising the total number of ratio constraint violations and minimising total production rate variation. The algorithm namely adaptive multi-objective evolutionary algorithm based on decomposition hybridised with differential evolution algorithm (AMOEA/D-DE) is developed to tackle this problem. The performances in Pareto sense of AMOEA/D-DE are compared with COIN-E, MODE, MODE/D and MOEA/D. The results indicate that AMOEA/D-DE outperforms the others in terms of convergence-related metrics
āļāļēāļĢāļāļąāļāļĨāļģāļāļąāļāļāļēāļĢāļāļĨāļīāļāļĢāļāļĒāļāļāđāđāļāļāļĄāļēāļāļ§āļąāļāļāļļāļāļĢāļ°āļŠāļāļāđāļāļāļŠāļēāļĒāļāļēāļĢāļāļĢāļ°āļāļāļāļāļĨāļīāļāļ āļąāļāļāđāļāļŠāļĄāđāļāļāļŠāļāļāļāđāļēāļMany-Objective Car Sequencing Problem on Mixed-model Two-sided Assembly Lines
āļ§āļīāļāļĩāļāļēāļĢāđāļāļīāļāļ§āļīāļ§āļąāļāļāļēāļāļēāļĢāđāļāļāļŦāļĨāļēāļĒāļ§āļąāļāļāļļāļāļĢāļ°āļŠāļāļāđāđāļāļĒāļĒāļķāļāļŦāļĨāļąāļāļāļēāļĢāļāļģāđāļāļ (A Multi-Objective Evolutionary Algorithm based on Decomposition; MOEA/D) āđāļāđāļāđāļĄāļāļēāļŪāļīāļ§āļĢāļīāļŠāļāļīāļāđāļāļīāļāļ§āļīāļ§āļąāļāļāļēāļāļēāļĢāļāļĩāđāđāļāđāļĢāļąāļāļāļēāļĢāļāļąāļāļāļēāļĄāļēāđāļāļ·āđāļāđāļāđāļāļąāļāļŦāļēāđāļāļāļĄāļēāļāļ§āļąāļāļāļļāļāļĢāļ°āļŠāļāļāđ (Many-Objective Optimization Problems; MaOPs) āđāļāļĒāļĄāļĩāđāļāļ§āļāļīāļāđāļāļāļēāļĢāļāđāļāļŦāļēāļāļģāļāļāļāļāđāļ§āļĒāļāļēāļĢāļāļģāđāļāļāļāļąāļāļŦāļēāļāļāļāđāļāđāļāļāļąāļāļŦāļēāļĒāđāļāļĒāđāļāļ·āđāļāļŦāļēāļāļģāļāļāļāļāļĩāđāļāļĩāļāļĩāđāļŠāļļāļāļāļāļāļāļąāļāļŦāļēāļĒāđāļāļĒāļāļąāđāļāđ āļāļēāļāļ§āļīāļāļąāļĒāļāļĩāđ āļāļķāļāđāļŠāļāļ MOEA/D āļĄāļēāđāļāļĢāļĩāļĒāļāđāļāļĩāļĒāļāļāļąāļāļ§āļīāļāļĩāļāļēāļĢāļ§āļīāļ§āļąāļāļāļēāļāļēāļĢāđāļāļĒāđāļāđāļāļĨāļāđāļēāļāđāļāļāļŦāļĨāļēāļĒāļ§āļąāļāļāļļāļāļĢāļ°āļŠāļāļāđ (Multi-Objective Differential Evolution Algorithm; MODE) āđāļāļāļēāļĢāđāļāđāļāļąāļāļŦāļēāļāļēāļĢāļāļąāļāļĨāļģāļāļąāļāļāļēāļĢāļāļĨāļīāļāļĢāļāļĒāļāļāđāđāļāļāļĄāļēāļāļ§āļąāļāļāļļāļāļĢāļ°āļŠāļāļāđāļāļāļŠāļēāļĒāļāļēāļĢāļāļēāļĢāļāļĢāļ°āļāļāļāļŠāļāļāļāđāļēāļ āļāļķāđāļāļāļđāļāļāļąāļāđāļāđāļāļāļąāļāļŦāļē MaOPs āđāļĨāļ°āļāļąāļāļŦāļēāļāļĢāļ°āđāļ āļāđāļāđāļāļāļĩāļĒāļēāļ (Non-deterministic Polynomial Hard; NP-Hard) āđāļāļ·āđāļāļāļāļēāļāļĄāļĩāļāļ§āļēāļĄāļāļąāļāļāđāļāļāđāļĨāļ°āļāļģāļāļ§āļāļāļģāļāļāļāļāļĩāđāļĄāļēāļ āđāļāļĒāļĄāļĩāļ§āļąāļāļāļļāļāļĢāļ°āļŠāļāļāđāļāļĩāđāļāļđāļāļāļĢāļ°āđāļĄāļīāļāļāļĢāđāļāļĄāļāļąāļ 5 āļ§āļąāļāļāļļāļāļĢāļ°āļŠāļāļāđ āđāļāđāđāļāđ āļāļģāļāļ§āļāļāļĢāļąāđāļāļāļēāļĢāđāļāļĨāļĩāđāļĒāļāđāļāļĨāļāļŠāļĩāļāđāļāļĒāļāļĩāđāļŠāļļāļ āļāļģāļāļ§āļāļĢāļāļĒāļāļāđāļāļĩāđāļĨāļ°āđāļĄāļīāļāļĢāļ§āļĄāļāđāļāļĒāļāļĩāđāļŠāļļāļ āļāļĢāļīāļĄāļēāļāļāļēāļāļāļĩāđāļāļģāđāļĄāđāđāļŠāļĢāđāļāđāļāļāļēāļĢāļāļĨāļīāļāļāđāļāļĒāļāļĩāđāļŠāļļāļ āđāļ§āļĨāļēāļĢāļāļāļāļĒāļāļēāļāļĢāļ§āļĄāđāļāļāļēāļĢāļāļĨāļīāļāļāđāļāļĒāļāļĩāđāļŠāļļāļ āđāļĨāļ°āļāļ§āļēāļĄāđāļāļĢāļāļąāļāļĢāļ§āļĄāļāļāļāļŠāļąāļāļŠāđāļ§āļāļāļēāļĢāļāļĨāļīāļāļāđāļāļĒāļāļĩāđāļŠāļļāļ āļāļķāđāļāļāļēāļāļāļēāļĢāļāļģāļĨāļāļāļāļāļ§āđāļē MOEA/D āļĄāļĩāļŠāļĄāļĢāļĢāļāļāļ°āļāđāļēāļāļāļēāļĢāļĨāļđāđāđāļāđāļēāļŠāļđāđāļāļģāļāļāļāļāļĩāđāđāļāđāļāļĢāļīāļāđāļĨāļ°āđāļ§āļĨāļēāļāļĩāđāđāļāđāļāļĩāļāļ§āđāļē MODEA Multi-objective Evolutionary Algorithm based on Decomposition (MOEA/D) is an evolutionary metaheuristic which has been developed to solve Many-Objective Optimization Problems (MaOPs). The concept of searching for answers is to decompose the original problem into subproblems for finding the optimal solution of each subproblem. This study proposes a MOEA/D compared with a Multi-Objective Differential Evolution algorithm (MODE) in order to solve many-objective car sequencing problem on twosided assembly lines which is classified as a MaOPs and be non-deterministic polynomial hard problem (NP-Hard problem) due to complexity and a large number of solutions. Five objectives were simultaneously evaluated, including the minimal number of color changes, of vehicle violations, along with the minimum amount of unfinished production, of total idle time of the line, and of total variation in rate of production. The experiments showed that MOEA/D has better aspects of convergence performance and time consumption than MODE counterpart